Inscribed Approximation based Adaptive Tessellation of Catmull-Clark Subdivision Surfaces
نویسنده
چکیده
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive tessellation reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this paper, we present a new adaptive tessellation method for general Catmull-Clark subdivision surfaces. Different from previous control mesh refinement based approaches, which generate approximate meshes that usually do not interpolate the limit surface, the new method is based on direct evaluation of the limit surface to generate an inscribed polyhedron of the limit surface. With explicit evaluation of general Catmull-Clark subdivision surfaces becoming available, the new adaptive tessellation method can precisely measure error for every point of the limit surface. Hence, it has complete control of the accuracy of the tessellation result. Cracks are avoided by using a recursive color marking process to ensure that adjacent patches or subpatches use the same limit surface points in the construction of the shared boundary. The new method performs limit surface evaluation only at points that are needed for the final rendering process. Therefore it is very fast and memory efficient. The new method is presented for the general Catmull-Clark subdivision scheme. But it can be used for any subdivision scheme that has an explicit evaluation method for its limit surface.
منابع مشابه
Adaptive Rendering of Catmull-Clark Subdivision Surfaces based on Inscribed Approximation
Subdivision provides a powerful scheme for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive rendering reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this paper, we present a new...
متن کاملHardware Subdivision and Tessellation of Catmull-Clark Surfaces
We present a table driven approach to performing Catmull-Clark subdivision in parallel utilizing one thread per output mesh vertex. We apply the procedure one or two times in order to isolate extraordinary vertices and simplify the input patch structures consumed by the hardware unit responsible for adaptive tessellation. From this simplified mesh, we evaluate the performance Stam’s direct eval...
متن کاملNear-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces
A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adaptive tessellation for rendering purpose is a recursive error evaluation and globalization process. The adaptive tessellation process is done by generating an inscribing polyhedron to approximate the limit surface for each indiv...
متن کاملPREPRINT PREPRINT PREPRINT PREPRINT To appear TOG 2012 Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces
We present a novel method for high-performance GPU based rendering of Catmull-Clark subdivision surfaces. Unlike previous methods, our algorithm computes the true limit surface up to machine precision, and is capable of rendering surfaces that conform to the full RenderMan specification for Catmull-Clark surfaces. Specifically, our algorithm can accommodate base meshes consisting of arbitrary v...
متن کامل